Suffix Graph - An Efficient Approach for Network Motif Mining

Graph Mining of Motif Profiles For Computer Network Activity Inference

An important component of network resource management and security enforcement is recognizing the applications active on a network. Unfortunately payload encryption and the use of non-standard ports render traditional application identification methods marginally useful. Newer in-the-dark application discovery methods can contend with these conditions, but still rely on packet level information...

An Efficient Approach for Association Rule Mining

A great research work has been done in last decade in association rules mining (ARM) algorithms . Therefore, various algorithms were proposed to discover frequent item sets and then mine association rules. Apriori algorithm is the most frequently used algorithm for generating association rules. Apriori algorithm has some abuses, such as too many scans of the database, large load of system’s I/O...

An efficient approach for solving layout problems

This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...

Using Suffix Trees for Gapped Motif Discovery

The Virtual Suffix Tree: An Efficient Data Structure for Suffix Trees and Suffix Arrays

We introduce the VST (virtual suffix tree), an efficient data structure for suffix trees and suffix arrays. Starting from the suffix array, we construct the suffix tree, from which we derive the virtual suffix tree. The VST provides the same functionality as the suffix tree, including suffix links, but at a much smaller space requirement. It has the same linear time construction even for large ...